class Solution {
    typedef pair<int, int> PII;

    int dx[4] = { 0, 0, -1, 1 };
    int dy[4] = { 1, -1, 0, 0 };
    bool vis[101][101];
public:
    int nearestExit(vector<vector<char>>& maze, vector<int>& entrance) {
        int m = maze.size(), n = maze[0].size();
        queue<PII> q;
        q.push({ entrance[0], entrance[1] });
        vis[entrance[0]][entrance[1]] = true;

        int ret = 0;
        while (q.size())
        {
            ret++;
            int sz = q.size();
            while (sz--)
            {
                auto [a, b] = q.front();
                q.pop();
                for (int k = 0; k < 4; k++)
                {
                    int x = dx[k] + a, y = dy[k] + b;
                    cout << x << " " << y << endl;
                    if (x >= 0 && x < m && y >= 0 && y < n && !vis[x][y] && maze[x][y] == '.')
                    {
                        if (x == 0 || x == m - 1 || y == 0 || y == n - 1)
                            return ret;

                        q.push({ x, y });
                        vis[x][y] = true;
                    }
                }
            }
        }

        return -1;
    }
};